Mechanized Veri cation of Compiler Backends

We describe an approach to mechanically prove the correctness of BURS speciications and show how such a tool can be connected with BURS based back-end generators 9]. The proofs are based on the operational semantics of both source and target system languages speciied by means of Abstract State Machines 15]. In 31] we decomposed the correctness condition based on these operational semantics into local correctness conditions for each BURS rule and showed that these local correctness conditions can be proven independently. The speciication and veriication system PVS is used to mechanicalyy verify BURS-rules based on formal representations of the languages involved. In particular, we have deened PVS proof strategies which enable an automatic veriication of the rules. Using PVS, several erroneous rules have been found. Moreover, from failed proof attempts we were able to correct them.